def ccc(s):
try:return int(s)
except:return ord(s)-ord("A")+10
q=input()
a,b=q.split(":")
a=a[::-1]
b=b[::-1]
def acc(p,q,b):
s=0
for i in range(len(p)):
if ccc(p[i])>=b:return False
s+=(b**i)*ccc(p[i])
if s>=24:return False
s=0
for i in range(len(q)):
if ccc(q[i])>=b:return False
s+=(b**i)*ccc(q[i])
if s>=60:return False
return True
c=0
if acc(a,b,100):
print(-1)
c=1
else:
for i in range(1,100):
if acc(a,b,i):
print(i,end=" ")
c+=1
if not c:print(0)
1535A - Fair Playoff | 1538F - Interesting Function |
1920. Build Array from Permutation | 494. Target Sum |
797. All Paths From Source to Target | 1547B - Alphabetical Strings |
1550A - Find The Array | 118B - Present from Lena |
27A - Next Test | 785. Is Graph Bipartite |
90. Subsets II | 1560A - Dislike of Threes |
36. Valid Sudoku | 557. Reverse Words in a String III |
566. Reshape the Matrix | 167. Two Sum II - Input array is sorted |
387. First Unique Character in a String | 383. Ransom Note |
242. Valid Anagram | 141. Linked List Cycle |
21. Merge Two Sorted Lists | 203. Remove Linked List Elements |
733. Flood Fill | 206. Reverse Linked List |
83. Remove Duplicates from Sorted List | 116. Populating Next Right Pointers in Each Node |
145. Binary Tree Postorder Traversal | 94. Binary Tree Inorder Traversal |
101. Symmetric Tree | 77. Combinations |